Random pseudo-polynomial algorithms for exact matroid problems
نویسندگان
چکیده
منابع مشابه
Algebraic Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several well-known combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our work yields new randomized algorithms that are the most efficient known. For non-bipartite matching, we obtain a simple, purely algebraic algorithm with running time O(n) where n is the number of vertices and ω is the m...
متن کاملExact and Approximation Algorithms for Weighted Matroid Intersection
In this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our approximation algorithm delivers a (1 − ε)-approximate solution with a running time significantly faster than most known exact algorithms. The core of our algorithms is a decomposit...
متن کاملExact Algorithms for Exact Satisfiability Problems
This thesis presents exact means for solving a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (Xsat) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties. While developing exact algorithms to solve the problems, we gain new insights into their structure and mutual similarities and differences...
متن کاملRandom sampling and greedy sparsification for matroid optimization problems
Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the eeectiveness of these paradigms for two optimization problems on matroids: nding an optimum matroid basis and packing disjoint matroid bases. Applications of th...
متن کاملRandom Sampling and Greedy Sparsiication for Matroid Optimization Problems
Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the eeectiveness of these paradigms for two optimization problems on matroids: nding an optimum matroid basis and packing disjoint matroid bases. Applications of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1992
ISSN: 0196-6774
DOI: 10.1016/0196-6774(92)90018-8